منابع مشابه
Computing Abelian Periods in Words
In the last couple of years many works have been devoted to Abelian complexity of words. Recently, Constantinescu and Ilie (Bulletin EATCS 89, 167–170, 2006) introduced the notion of Abelian period. We show that a word w of length n over an alphabet of size σ can have Θ(n2) distinct Abelian periods. However, to the best of our knowledge, no efficient algorithm is known for computing these perio...
متن کاملPeriods and Binary Words
We give an elementary short proof for a well-known theorem of Guibas and Odlyzko stating that the sets of periods of words are independent of the alphabet size. As a consequence of our constructing proof, we give a linear time algorithm which, given a word, computes a binary one with the same periods. We give also a very short proof for the famous Fine and Wilf's periodicity lemma.
متن کاملPeriods, Capitalized Words, etc
In this article we present an approach for tackling three important aspects of text normalization: sentence boundary disambiguation, disambiguation of capitalized words in positions where capitalization is expected, and identification of abbreviations. As opposed to the two dominant techniques of computing statistics or writing specialized grammars, our document-centered approach works by consi...
متن کاملPeriods in Partial Words: An Algorithm
This is the author’s version of a work that was accepted for publication in Journal of Discrete Algorithms. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version...
متن کاملAlgorithms for Computing Abelian Periods of Words
Constantinescu and Ilie (Bulletin EATCS 89, 167–170, 2006) introduced the notion of an Abelian period of a word. A word of length n over an alphabet of size σ can have Θ(n2) distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time O(n2× σ) using O(n × σ) space. We present an off-line algorithm based on a select function having the same worst-case th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2006
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-006-0014-z